Public vs Private Coin in Bounded-Round Information
نویسندگان
چکیده
We precisely characterize the role of private randomness in the ability of Alice to send a message to Bob while minimizing the amount of information revealed to him. We show that if using private randomness a message can be transmitted while revealing I bits of information, the transmission can be simulated without private coins using I + log I +O(1) bits of information. Moreover, we give an example where this bound is tight: at least I + log I − O(1) bits are necessary in some cases. Our example also shows that the one-round compression construction of Harsha et al. [HJMR07] cannot be improved.
منابع مشابه
A direct product theorem for bounded-round public-coin randomized communication complexity
A strong direct product theorem for a problem in a given model of computation states that, in order to compute k instances of the problem, if we provide resource which is less than k times the resource required for computing one instance of the problem with constant success probability, then the probability of correctly computing all the k instances together, is exponentially small in k. In thi...
متن کاملTowards a Reversed Newman’s Theorem in Interactive Information Complexity
Newman’s theorem states that we can take any public-coin protocol and convert it into one that uses only private randomness with only a little increase in communication complexity. We consider a reversed scenario in the context of information complexity: can we take a protocol that uses private randomness and convert it into one that only uses public randomness while preserving the information ...
متن کاملPrivate Coins versus Public Coins in Zero-Knowledge Proof Systems
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “fully black-box” privatecoin protocols based on one-way functions. More precisely, we show that only languages in BPP—where Sam is a “collision-finding” oracle in analogy with Simon (Eurocrypt’98) and Haitner et. al (FOCS’07...
متن کاملCS 710 : Complexity Theory 4 / 20 / 2010 Lecture 25 : Interactive Proofs
Last time we introduced the notion of interactive proof systems which models computation as a result of interaction between two parties. We defined public/private coin protocols, and showed that the graph non-isomorphism problem admits an interactive proof using private coins, as well as one using public coins. Today we will continue our discussion of interactive proof systems. We will study th...
متن کاملPrecise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. [23] in Eurocrypt’08 (which generalizes the work on precise zero-knowledge by Micali and Pass [19] in STOC’06). This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in the almost same time. [23] constructed some (private-coin) concurrent zero-knowledge argument sys...
متن کامل